CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

Source URL: www.math.uni-frankfurt.de

MWEs: Theoretical Background & Motivation MWEs: Computational Methods Resources, tasks and applications Future challenges and open problems Robust Semantic Analysis of Multiword

Source URL: www.emnlp2015.org

Computational recipes for electromagnetic inverse problems

Source URL: geomag.usgs.gov

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

Thursday 31 March EvoCOP 1 - Real World Applications, 11:30-13:10 Chaired by Francisco Chicano Particle Swarm Optimization for Multi-Objective Web Service Location Allocation,

Source URL: www.evostar.org

• Mathematics
• Operations research
• Computational complexity theory
• Applied mathematics
• Mathematical optimization
• NP-complete problems
• Cybernetics
• Heuristics
• Hyper-heuristic
• Genetic algorithm
• Travelling salesman problem
• Evolutionary algorithm

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal